Further Results on Multiparametric Quadratic Programming
نویسندگان
چکیده
In this paper we extend recent results on strictly convex multiparametric quadratic programming (mpQP) to the convex case. An efficient method for computing the mpQP solution is provided. We give a fairly complete description of the mpQP solver, focusing on implementational issues such as degeneracy handling.
منابع مشابه
A New Approach for Solving Interval Quadratic Programming Problem
This paper discusses an Interval Quadratic Programming (IQP) problem, where the constraints coefficients and the right-hand sides are represented by interval data. First, the focus is on a common method for solving Interval Linear Programming problem. Then the idea is extended to the IQP problem. Based on this method each IQP problem is reduced to two classical Quadratic Programming (QP) proble...
متن کاملAn Efficient Algorithm for Computing the State Feedback Optimal Control Law for Discrete Time Hybrid Systems
In this paper we propose an.efficient algorithm for computing the solution to the finite time optimal control problem for discrete time linear hybrid systems with a quadratic performance criterion. The algorithm is based on a dynamic programming recursion and a multiparametric quadratic programming solver.
متن کاملExperiments in Multi-parametric Quadratic Programming
The paper deals with a short presentation of the basic ideas concerning the multiparametric quadratic programming (mp-QP) problems. The model predictive control is considered also as particular mp-QP problem. Since the solutions to mp-QP problems can be expressed as piecewise affine linear functions of the state, a new implementation in terms of adaptive network-based fuzzy inference systems is...
متن کاملMultiparametric Linear and Quadratic Programming
In this work we present an algorithm for the solution of multiparametric linear and quadratic programming problems.With linear constraints and linear or convex quadratic objective functions, the optimal solution of these optimization problems is given by a conditional piecewise linear function of the varying parameters. This function results from first-order estimations of the analytical nonlin...
متن کاملA Method for Solving Convex Quadratic Programming Problems Based on Differential-algebraic equations
In this paper, a new model based on differential-algebraic equations(DAEs) for solving convex quadratic programming(CQP) problems is proposed. It is proved that the new approach is guaranteed to generate optimal solutions for this class of optimization problems. This paper also shows that the conventional interior point methods for solving (CQP) problems can be viewed as a special case of the n...
متن کامل